A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions
نویسندگان
چکیده
منابع مشابه
Observability of Boolean networks: A graph-theoretic approach
Boolean networks (BNs) are discrete-time dynamical systems with Boolean state-variables and outputs. BNs are recently attracting considerable interest as computational models for genetic and cellular networks. We consider the observability of BNs, that is, the possibility of uniquely determining the initial state given a time sequence of outputs. Our main result is that determining whether a BN...
متن کاملCryptographic Boolean Functions with R
A Boolean function is a mapping {0,1}n → {0,1}. Those mappings are of much interest in the design of cryptographic algorithms such as secure pseudorandom number generators (for the design of stream ciphers among other applications), hash functions and block ciphers. The lack of open source software to assess cryptographic properties of Boolean functions and the increasing interest for statistic...
متن کاملA module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملBoolean functions with all main cryptographic properties
In this paper, we propose a class of 2k-variable Boolean functions which have optimal algebraic degree, very high nonlinearity, and are 1-resilient. Based on our newly proposed conjecture, it can be shown that the algebraic immunity of our functions is at least suboptimal. Moreover, when k is odd, the algebraic immunity is actually optimal, and for even k, we find that the algebraic immunity is...
متن کاملBoolean Functions with Five Controllable Cryptographic Properties
The Strict Avalanche Criterion (SAC) was introduced by Webster and Tavares in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptographically strong functions, Zhang and Zheng introduced the global avalanche characteristics (GAC). The sum-of-squares indicator related to the GAC is defined as σf = ∑ v ∆ 2 f (v), wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2019
ISSN: 2075-1680
DOI: 10.3390/axioms8020040